Description: 这是一个求网络最小费用最大流问题的一个C++的程序已经经过调试,请放心使用.-This is a minimum cost network for the largest flow of a C procedures after debugging, please rest assured that use. Platform: |
Size: 5179 |
Author:下沙 |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853760 |
Author:陈宝文 |
Hits:
Description: 我在程序文件中所使用的计算最小费用最大流的算法并没有先用福德－富克逊法算出最大流，然后再用对偶法算出最小费用，而是将两种算法结合，最小费用和最大流一起算出-I said in my program files used in the calculation of the minimum cost maximum flow algorithm does not first Ford- Fu Dixon calculated maximum flow and then calculated the dual minimum cost, but will combine two algorithms, minimum cost and calculate maximum flow together Platform: |
Size: 1024 |
Author:积分 |
Hits:
Description: 解决最小费用最大流的问题，是一个通用程序，希望大家喜欢-Solve the minimum cost maximum flow problem is a common procedure, hope you like Platform: |
Size: 1024 |
Author:zhai |
Hits:
Description: 本程序用来求有向网络中的最大流和最小费用的问题。这里最小费用是在可能有多个最大流的基础上优化得到的。故前提条件是最大流，如果没有没有最大流，可以不运输，成本为0，那就没有意义了。-This program used to beg for the maximum flow to the network and the minimum cost.
Here is the minimum cost in May have multiple maximum flow based on optimization get.
So premise condition is maximum flow, if no no maximum flow, can not transport, the cost of 0, that is no sense.
Platform: |
Size: 2048 |
Author:DuWenSheng |
Hits:
Description: “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
-" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow. Platform: |
Size: 1024 |
Author:biaoshi |
Hits:
Description: 实现的是最小费用最大流问题，在残量网络中找s-t最短路，运用bellman-ford算法。-To achieve the minimum cost maximum flow problem, in the residual network, find the shortest st, the use of bellman-ford algorithm. Platform: |
Size: 1024 |
Author:张佳静 |
Hits:
Description: 通过matlab程序实现最小费用最大流算法，获取最多的经济效益-By matlab program for minimum cost maximum flow algorithm, get the most cost-effective Platform: |
Size: 2048 |
Author:魏俊 |
Hits:
Description: 关于图论中最小费用最大流的PPT介绍，解释很详尽，对于本题目的算法很有帮助-Graph theory about the minimum cost maximum flow PPT introduction, the explanation is very detailed, for ontology purpose algorithm is very helpful
Platform: |
Size: 280576 |
Author:liuhuiyi |
Hits:
Description: C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash method, augmented road algorithm, network maximum flow _ adjlink etc...... Platform: |
Size: 995328 |
Author:zhzhl |
Hits:
Description: 最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.- Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow. Platform: |
Size: 5120 |
Author:fuhai |
Hits:
Description: 最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.-Minimum cost maximum flow algorithm general Matlab functions The basic idea of the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow. Platform: |
Size: 4096 |
Author:fuhai |
Hits:
Description: 有向图中，求最小费用最大流的一种方法，matlab-Directed graph, and the minimum cost and maximum flow of a kind of method Platform: |
Size: 1024 |
Author:Crazy |
Hits:
Description: 算法基础的报告出要实现了求解网络最大流最小费用的问题-Algorithm based report a problem solving network maximum flow minimum cost Platform: |
Size: 1414144 |
Author:Daydreamer |
Hits:
Description: 图论算法及MATLAB程序代码,包含算法pdf文档和M文件。Warshall-Floyad算法，Kruskal避圈法，匈牙利算法，可行点标记求最佳匹配算法，Ford--Fulkerson标号法求最大流算法，最小费用最大流算法。求解数学模型必备！-Graph theory algorithms and MATLAB code contains of algorithm pdf documents and M files. The the Warshall-Floyad algorithm, Kruskal avoid lap law, Hungary algorithm feasible point mark for the best matching algorithm, Ford- Fulkerson labeling method for maximum flow algorithm, minimum cost maximum flow algorithm. To solve the mathematical model is essential! Platform: |
Size: 207872 |
Author:Binjie Liao |
Hits:
Description: 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms template (bipartite graph matching Hungarian algorithm, the minimum spanning tree the prime and kruskal algorithm, Dijkstra algorithm, two shortest path negative weight value side SPFA algorithm, Fig any two points on the shortest path Floy algorithms, network flow SAP algorithms, network maximum flow minimum cost algorithm multiplicative inverse gcd expansion algorithm, segment tree interval division statistical algorithms, the matrix of the n-th power of divide and conquer to solve the gcd algorithm, integer division problem, the minimum point of the function, decimal turn ACM algorithm, primes screening method solving and Euler function, fast mode algorithm, the string matching KMP algorithm, a dictionary full array algorithm, fast row, the sort of three dimensional) Platform: |
Size: 18432 |
Author:林云 |
Hits:
Search - Minimum Cost Flow